- implementations of mergesort
- Программирование: реализация сортировки слиянием
Универсальный англо-русский словарь. Академик.ру. 2011.
implementations of mergesort
Смотреть что такое "implementations of mergesort" в других словарях:
Standard ML — Infobox programming language name = Standard ML logo = paradigm = multi paradigm: functional, imperative year = designer = typing = strong, static, inferred dialects = Alice, Dependent ML implementations = MLton, MLWorks, Moscow ML, Poly/ML,… … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
Quicksort — Infobox Algorithm class=Sorting algorithm Quicksort in action on a list of numbers. The horizontal lines are pivot values. data=Varies time=O(nlog n) on average space=Varies by implementation optimal=Sometimes Stability= [Sorting… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Insertion sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallyInsertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time … Wikipedia
Bogosort — Class Sorting algorithm Data structure Array Worst case performance [1] Best case performance Ω … Wikipedia
